The Newton–Puiseux Algorithm and Triple Points for Plane Curves

نویسندگان

چکیده

The paper is an introduction to the use of classical Newton–Puiseux procedure, oriented towards algorithmic description it. This procedure allows obtain polynomial approximations for parameterizations branches algebraic plane curve at a singular point. We look approach that can be easily grasped and almost self-contained. illustrate algorithm first in completely worked out example with point multiplicity 6, secondly, study triple points on reduced curves.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Singular Points of Plane Curves

ly isomorphic to (C×)r−1 × (C), and hence also to (S1)r−1 × (R), where r = |J | is the number of branches and k = δ(C)− r+1 = 1 2 (μ(C) + 1 − r). The construction of the Jacobian variety J(C̃) of the non-singular curve C̃ in the large is standard in algebraic geometry. There is also a notion of Jacobian of a singular curve C , defined e.g. in [85], which, like the other, is an abelian group. Ther...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Inflexion Points on Plane Algebraic Curves

In this thesis we will have a look at algebraic curves in the projective plane over an arbitrary algebraically closed field k. Using the resultant of polynomial rings over k we define intersection multiplicities and prove Bézout’s Theorem for effective divisors. We define singularities and inflexion points and count their number depending on the degree of the curve, using the Hessian of a curve.

متن کامل

Computing singular points of plane rational curves

We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the μ-basis of the curve. It is shown that singularity factors, which are defined and uniquely determined by the elementary divisors of the implicitization matrix, contain all the information about the singular points, such as the parameter values of the singular points ...

متن کامل

Constructions of Plane Curves with Many Points

In this paper we investigate some plane curves with many points over Q, finite fields and cyclotomic fields. In a previous paper [4] the first two authors constructed a sequence of absolutely irreducible polynomials Pd(x, y) ∈ Z[x, y] of degree d having low height and many integral solutions to Pd(x, y) = 0. (The definition of these polynomials will be recalled in §4.) Here we construct further...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11102324